Semantics-based Nonmonotonic Inference
نویسنده
چکیده
In this paper we discuss Gabbay’s idea of basing nonmonotonic deduction on semantic consequence in intuitionistic logic extended by a consistency operator and Turner’s suggestion of replacing the intuitionistic base system by Kleene’s three-valued logic. It is shown that a certain counterintuitive feature of these approaches can be avoided by using Nelson’s constructive logic N instead of intuitionistic logic or Kleene’s system. Moreover, in N a more general notion of consistency can be defined and nonmonotonic deduction can thus be based on a logical system satisfying the Deduction Theorem.
منابع مشابه
Production and Causal Logics for Nonmonotonic Reasoning
We introduce logical formalisms of production and causal inference relations based on input/output logics of [Makinson and van der Torre, 2000]. These inference relations are assigned, however, both standard monotonic semantics, and natural nonmonotonic semantics based on the principle of explanatory closure. The resulting nonmonotonic formalisms will be shown to provide a logical representatio...
متن کاملA Non-monotonic ATMS Based on Annotated Logic Programs with Strong Negation
In this paper,we translate Dressler's nonmonotonic ATMS with out-assumption [Dr88] into an annotated logic program with strong negation(ALPSN) which was proposed in [NS94]. Nonmonotonic justi cations and assumption nodes of Dressler's ATMS are translated into annotated logic program clauses with strong negation. The most important semantics for Dressler's ATMS is the extension. On the other han...
متن کاملIs Intractability of Non-Monotonic Reasoning a Real Drawback?
Several studies about computational complexity of nonmonotonic reasoning (NMR) showed that nonmonotonic inference is significantly harder than classical, monotonic inference. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder. In this paper we show that, to some extent, NMR fulfills the representation goal. In particular,...
متن کاملDisjunctive Logic Programming as
Earlier, we have proposed a logic, called priority logic 16, 18], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as a reasoning based on selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this p...
متن کاملSemantics for Constrained and Rational Default Logics
The default nonmonotonic reasoning was formalised by a class of logical systems: default logics (classical, justified, constrained, rational), based on the same syntax which utilises nonmonotonic inference rules: defaults, but with different semantics for the defaults. In this paper we introduce a uniform semantic characterisation for the constrained and rational extensions of a default theory....
متن کاملA New Logical Characterisation of Stable Models and Answer Sets
This paper relates inference in extended logic programming with non-classical, nonmonotonic logics. We deene a nonmonotonic logic, called equilibrium logic, based on the least constructive extension, N2, of the intermediate logic of \here-and-there". We show that on logic programs equilibrium logic coincides with the inference operation associated with the stable model and answer set semantics ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 36 شماره
صفحات -
تاریخ انتشار 1995